Routing in Virtual Path Based ATM Networks

We consider the issue of routing requests for virtual circuits in a Virtual Path (VP) based ATM network. We suppose that the VPs are partitioned in a manner such that all the VCs making use of any given VP have the same traac characteristics and quality of service demands. A virtual circuit request can be accepted in the network only if the speciied loss and delay bounds can be guaranteed for the cells belonging to it. After making suitable simplifying assumptions about the operation of the network , simple admission rules for virtual circuit requests are proposed. Routing policies are then proposed that try to minimize the fraction of virtual circuit requests denied. Simulations are carried out to evaluate the proposed routing policies.